Maximum principal ratio of the signless Laplacian of graphs
نویسندگان
چکیده
Let G be a connected graph and Q(G) the signless Laplacian of G. The principal ratio γ(G) is maximum minimum entries Perron vector Q(G). In this paper, we consider among all graphs order n, show that for sufficiently large n extremal kite obtained by identifying an end vertex path to any complete graph.
منابع مشابه
Seidel Signless Laplacian Energy of Graphs
Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملEla the Signless Laplacian Separator of Graphs
Received by the editors on July 22, 2010. Accepted for publication on February 17, 2011. Handling Editor: Bryan Shader. School of Mathematical Science, South China Normal University, Guangzhou, 510631, P.R. China ([email protected], Zhifu You; [email protected], Bolian Liu). This work was supported by the NNSF of China (No. 11071088). Electronic Journal of Linear Algebra ISSN 1081-3810 A publi...
متن کاملThe signless Laplacian separator of graphs
The signless Laplacian separator of a graph is defined as the difference between the largest eigenvalue and the second largest eigenvalue of the associated signless Laplacian matrix. In this paper, we determine the maximum signless Laplacian separators of unicyclic, bicyclic and tricyclic graphs with given order.
متن کاملCharacterizing Graphs Of Maximum Principal Ratio
The principal ratio of a connected graph, denoted γ(G), is the ratio of the maximum and minimum entries of its first eigenvector. Cioabă and Gregory conjectured that the graph on n vertices maximizing γ(G) is a kite graph: a complete graph with a pendant path. In this paper we prove their conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2022
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2022.08.026